Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
Identifieur interne : 004C88 ( Main/Exploration ); précédent : 004C87; suivant : 004C89Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
Auteurs : Laurent Dupont [France] ; Michael Hemmer [Allemagne] ; Sylvain Petitjean [France] ; Elmar Schömer [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always computes the mathematically correct result. It is efficient measured in running times, i.e. it compares favorably to the only previous implementation.
Url:
DOI: 10.1007/978-3-540-75520-3_56
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002579
- to stream Istex, to step Curation: 002547
- to stream Istex, to step Checkpoint: 001073
- to stream Hal, to step Corpus: 001689
- to stream Hal, to step Curation: 001689
- to stream Hal, to step Checkpoint: 003826
- to stream Main, to step Merge: 004E22
- to stream Main, to step Curation: 004C88
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics</title><author><name sortKey="Dupont, Laurent" sort="Dupont, Laurent" uniqKey="Dupont L" first="Laurent" last="Dupont">Laurent Dupont</name></author><author><name sortKey="Hemmer, Michael" sort="Hemmer, Michael" uniqKey="Hemmer M" first="Michael" last="Hemmer">Michael Hemmer</name></author><author><name sortKey="Petitjean, Sylvain" sort="Petitjean, Sylvain" uniqKey="Petitjean S" first="Sylvain" last="Petitjean">Sylvain Petitjean</name></author><author><name sortKey="Schomer, Elmar" sort="Schomer, Elmar" uniqKey="Schomer E" first="Elmar" last="Schömer">Elmar Schömer</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A0A64E3AB0C7D77A072DF62F21DB923617126059</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-75520-3_56</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-DJ7SJFMT-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002579</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002579</idno><idno type="wicri:Area/Istex/Curation">002547</idno><idno type="wicri:Area/Istex/Checkpoint">001073</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001073</idno><idno type="wicri:doubleKey">0302-9743:2007:Dupont L:complete:exact:and</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00165663</idno><idno type="url">https://hal.inria.fr/inria-00165663</idno><idno type="wicri:Area/Hal/Corpus">001689</idno><idno type="wicri:Area/Hal/Curation">001689</idno><idno type="wicri:Area/Hal/Checkpoint">003826</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">003826</idno><idno type="wicri:Area/Main/Merge">004E22</idno><idno type="wicri:Area/Main/Curation">004C88</idno><idno type="wicri:Area/Main/Exploration">004C88</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics</title><author><name sortKey="Dupont, Laurent" sort="Dupont, Laurent" uniqKey="Dupont L" first="Laurent" last="Dupont">Laurent Dupont</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA, Nancy</wicri:regionArea><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Hemmer, Michael" sort="Hemmer, Michael" uniqKey="Hemmer M" first="Michael" last="Hemmer">Michael Hemmer</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Johannes Gutenberg-Universität, Institut für Informatik, Mainz</wicri:regionArea><placeName><region type="land" nuts="2">Rhénanie-Palatinat</region><settlement type="city">Mayence</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Petitjean, Sylvain" sort="Petitjean, Sylvain" uniqKey="Petitjean S" first="Sylvain" last="Petitjean">Sylvain Petitjean</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA, Nancy</wicri:regionArea><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Schomer, Elmar" sort="Schomer, Elmar" uniqKey="Schomer E" first="Elmar" last="Schömer">Elmar Schömer</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Johannes Gutenberg-Universität, Institut für Informatik, Mainz</wicri:regionArea><placeName><region type="land" nuts="2">Rhénanie-Palatinat</region><settlement type="city">Mayence</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always computes the mathematically correct result. It is efficient measured in running times, i.e. it compares favorably to the only previous implementation.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li><li>Rhénanie-Palatinat</li></region><settlement><li>Mayence</li><li>Nancy</li></settlement></list><tree><country name="France"><region name="Grand Est"><name sortKey="Dupont, Laurent" sort="Dupont, Laurent" uniqKey="Dupont L" first="Laurent" last="Dupont">Laurent Dupont</name></region><name sortKey="Dupont, Laurent" sort="Dupont, Laurent" uniqKey="Dupont L" first="Laurent" last="Dupont">Laurent Dupont</name><name sortKey="Petitjean, Sylvain" sort="Petitjean, Sylvain" uniqKey="Petitjean S" first="Sylvain" last="Petitjean">Sylvain Petitjean</name><name sortKey="Petitjean, Sylvain" sort="Petitjean, Sylvain" uniqKey="Petitjean S" first="Sylvain" last="Petitjean">Sylvain Petitjean</name></country><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Hemmer, Michael" sort="Hemmer, Michael" uniqKey="Hemmer M" first="Michael" last="Hemmer">Michael Hemmer</name></region><name sortKey="Hemmer, Michael" sort="Hemmer, Michael" uniqKey="Hemmer M" first="Michael" last="Hemmer">Michael Hemmer</name><name sortKey="Schomer, Elmar" sort="Schomer, Elmar" uniqKey="Schomer E" first="Elmar" last="Schömer">Elmar Schömer</name><name sortKey="Schomer, Elmar" sort="Schomer, Elmar" uniqKey="Schomer E" first="Elmar" last="Schömer">Elmar Schömer</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004C88 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004C88 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:A0A64E3AB0C7D77A072DF62F21DB923617126059
|texte= Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
}}
| This area was generated with Dilib version V0.6.33. |  |